Sieve Method for Polynomial Linear Equivalence
نویسندگان
چکیده
منابع مشابه
Non-linear polynomial selection for the number field sieve
We present an algorithm to find two non-linear polynomials for the Number Field Sieve integer factorization method. This algorithm extends Montgomery’s “two quadratics” method; for degree 3, it gives two skewed polynomials with resultant O(N5/4), which improves on Williams O(N4/3) result [12].
متن کاملMontgomery's method of polynomial selection for the number field sieve
The number field sieve is the most efficient known algorithm for factoring large integers that are free of small prime factors. For the polynomial selection stage of the algorithm, Montgomery proposed a method of generating polynomials which relies on the construction of small modular geometric progressions. Montgomery’s method is analysed in this paper and the existence of suitable geometric p...
متن کاملA General Polynomial Sieve
An important component of the index calculus methods for finding discrete logarithms is the acquisition of smooth polynomial relations. Gordon and McCurley (1992) developed a sieve to aid in finding smooth Coppersmith polynomials for use in the index calculus method. We discuss their approach and some of the difficulties they found with their sieve. We present a new sieving method that can be a...
متن کاملThe Multiple Polynomial Quadratic Sieve
A modification, due to Peter Montgomery, of Pomerance's Quadratic Sieve for factoring large integers is discussed along with its implementation. Using it, allows factorization with over an order of magnitude less sieving than the basic algorithm. It enables one to factor numbers in the 60-digit range in about a day, using a large minicomputer. The algorithm has features which make it well adapt...
متن کاملSieve Equivalence in Generalized Partition Theory
The sieve method (principle of inclusion-exclusion) is one of the most powerful tools of combinatorics. Given a set a of objects and a list 9 of properties of those objects, we determine the number N(Y; 2s) of objects in Q whose set of properties contains (those in 9 that are indexed by) the set S. We are then able to find the number of objects that have no properties, exactly k properties, etc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2013
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2013/872962